Symmetries in central-force problems

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Symmetries of Variational Problems

The applications of symmetry groups to problems arising in the calculus of variations have their origins in the late papers of Lie, e.g., [34], which introduced the subject of “integral invariants”. Lie showed how the symmetry group of a variational problem can be readily computed based on an adaptation of the infinitesimal method used to compute symmetry groups of differential equations. Moreo...

متن کامل

kurdish diaspora in central asia and caoucasus

در طول دو قرن گذشته و ظهور روسیه بعنوان قدرتی بزرگ در عرصه جهانی و شروع رقابت با سایر قدرت های بین المللی و منطقهای خصوصا با ایران و عثمانی این ئکشور تلاش کرده است تاد از جمعیت کردها در این کشورها در راستای منافع خود بهره برداری کند در قرون 18 و 19 بارها بخشی از کردها برعلیه امپراطوری عثمانی توسط این کشور مورد استفاده قرار گرفت خصوصا در جنگ های سال 1790تا 1798. این ججنگ ها م.جب شد که بخشی از کر...

15 صفحه اول

political economy of china in central asia

this research is about the political economy of china in central asia. in this research the political & economic interactions affected on chinas political economy in central asia are examined. chinas goal of presence in central asia including political-security, economic and energy goals is described in one part. in another part, the trade relations between china and central asian countries ar...

15 صفحه اول

Breaking symmetries in all different problems

Adding symmetry breaking constraints is one of the oldest ways of breaking variable symmetries for CSPs. For instance, it is well known that all the symmetries for the pigeon hole problem can be removed by ordering the variables. We have generalized this result to all CSPs where the variables are subject to an all different constraint. In such case it is possible to remove all variable symmetri...

متن کامل

Breaking Symmetries in Distributed Constraint Programming Problems

Though various preprocessing techniques have been studied for improving the performance of distributed constraint satisfaction problems, no approach for detecting and breaking symmetries has been studied in depth. In this paper, we describe a method for detecting some symmetries of a given distributed problem and for exploiting them. Then, we validate it as a preprocessing method forAdopt andDp...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Serbian Astronomical Journal

سال: 2003

ISSN: 1450-698X,1820-9289

DOI: 10.2298/saj0367047m